Share Computing Protocols over Fields and Rings
نویسندگان
چکیده
In this thesis, we explain linear secret sharing schemes, in particular multiplicative threshold linear secret sharing schemes, over fields and rings in a compact and concise way. We explain two characterisations of linear secret sharing schemes, and in particular, we characterise threshold linear secret sharing schemes. We develop an algorithm to generate all multiplicative (t+ 1)-out-of-n threshold linear secret sharing schemes over a field Zp. For the ring Z232 , we explain the generation of secret sharing schemes for threshold access structures and prove the non-existence of (t+1)-out-of-n threshold linear secret sharing schemes with n > t+ 1.
منابع مشابه
Witt rings of quadratically presentable fields
This paper introduces an approach to the axiomatic theory of quadratic forms based on {tmem{presentable}} partially ordered sets, that is partially ordered sets subject to additional conditions which amount to a strong form of local presentability. It turns out that the classical notion of the Witt ring of symmetric bilinear forms over a field makes sense in the context of {tmem{quadratically p...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملEfficient Multi-party Computation over Rings
Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these te...
متن کاملA New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملThe Reduced Witt Ring of a Formally
The reduced Witt rings of certain formally real fields are computed here in terms of some basic arithmetic invariants of the fields. For some fields, including the rational function field in one variable over the rational numbers and the rational function field in two variables over the real numbers, this is done by computing the image of the total signature map on the Witt ring. For a wider cl...
متن کامل